YES 0.42 H-Termination proof of /home/matraf/haskell/eval_FullyBlown_Fast/empty.hs
H-Termination of the given Haskell-Program with start terms could successfully be proven:



HASKELL
  ↳ LR

mainModule Main
  (((>>) :: IO a  ->  IO b  ->  IO b) :: IO a  ->  IO b  ->  IO b)

module Main where
  import qualified Prelude



Lambda Reductions:
The following Lambda expression
\_→q

is transformed to
gtGt0 q _ = q



↳ HASKELL
  ↳ LR
HASKELL
      ↳ BR

mainModule Main
  (((>>) :: IO a  ->  IO b  ->  IO b) :: IO a  ->  IO b  ->  IO b)

module Main where
  import qualified Prelude



Replaced joker patterns by fresh variables and removed binding patterns.

↳ HASKELL
  ↳ LR
    ↳ HASKELL
      ↳ BR
HASKELL
          ↳ COR

mainModule Main
  (((>>) :: IO b  ->  IO a  ->  IO a) :: IO b  ->  IO a  ->  IO a)

module Main where
  import qualified Prelude



Cond Reductions:
The following Function with conditions
undefined 
 | False
 = undefined

is transformed to
undefined  = undefined1

undefined0 True = undefined

undefined1  = undefined0 False



↳ HASKELL
  ↳ LR
    ↳ HASKELL
      ↳ BR
        ↳ HASKELL
          ↳ COR
HASKELL
              ↳ Narrow

mainModule Main
  ((>>) :: IO b  ->  IO a  ->  IO a)

module Main where
  import qualified Prelude



Haskell To QDPs